0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.12	% Command    : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM
0.12/0.33	% Computer : n011.cluster.edu
0.12/0.33	% Model    : x86_64 x86_64
0.12/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory   : 8042.1875MB
0.12/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1920
0.12/0.33	% WCLimit    : 240
0.12/0.33	% DateTime   : Wed Jul 30 02:58:04 EDT 2025
0.12/0.33	% CPUTime    : 
0.21/0.48	Running higher-order theorem proving
0.21/0.49	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.qpnQLvjgvK/E---3.1_5211.p
0.21/0.50	# Version: 3.0.0-ho
0.21/0.50	# Preprocessing class: HSSSSMSSSSSCHSA.
0.21/0.50	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.21/0.50	# Starting new_ho_10 with 1200s (5) cores
0.21/0.50	# Starting sh5l with 240s (1) cores
0.21/0.50	# Starting new_bool_1 with 240s (1) cores
0.21/0.50	# Starting new_bool_2 with 240s (1) cores
0.21/0.50	# new_bool_1 with pid 5298 completed with status 0
0.21/0.50	# Result found by new_bool_1
0.21/0.50	# Preprocessing class: HSSSSMSSSSSCHSA.
0.21/0.50	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.21/0.50	# Starting new_ho_10 with 1200s (5) cores
0.21/0.50	# Starting sh5l with 240s (1) cores
0.21/0.50	# Starting new_bool_1 with 240s (1) cores
0.21/0.50	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
0.21/0.50	# Search class: HHHSF-FFSF22-DHSFFMBC
0.21/0.50	# partial match(5): HGUSF-FFSF22-SHHFFMBN
0.21/0.50	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
0.21/0.50	# Starting new_ho_10 with 44s (1) cores
0.21/0.50	# new_ho_10 with pid 5300 completed with status 0
0.21/0.50	# Result found by new_ho_10
0.21/0.50	# Preprocessing class: HSSSSMSSSSSCHSA.
0.21/0.50	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.21/0.50	# Starting new_ho_10 with 1200s (5) cores
0.21/0.50	# Starting sh5l with 240s (1) cores
0.21/0.50	# Starting new_bool_1 with 240s (1) cores
0.21/0.50	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
0.21/0.50	# Search class: HHHSF-FFSF22-DHSFFMBC
0.21/0.50	# partial match(5): HGUSF-FFSF22-SHHFFMBN
0.21/0.50	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
0.21/0.50	# Starting new_ho_10 with 44s (1) cores
0.21/0.50	# Preprocessing time       : 0.001 s
0.21/0.50	# Presaturation interreduction done
0.21/0.50	
0.21/0.50	# Proof found!
0.21/0.50	# SZS status Theorem
0.21/0.50	# SZS output start CNFRefutation
0.21/0.50	thf(decl_23, type, epsii: (($i > $i) > $o) > $i > $i).
0.21/0.50	thf(decl_24, type, if: $o > ($i > $i) > ($i > $i) > $i > $i).
0.21/0.50	thf(decl_25, type, esk1_0: $i > $i).
0.21/0.50	thf(decl_26, type, esk2_0: $i > $i).
0.21/0.50	thf(ifd, axiom, ((if)=(^[X1:$o, X2:$i > $i, X3:$i > $i]:(epsii @ (^[X4:$i > $i]:((((X1)&((X4)=(X2)))|(~((X1))&((X4)=(X3))))))))), file('/export/starexec/sandbox2/tmp/tmp.qpnQLvjgvK/E---3.1_5211.p', ifd)).
0.21/0.50	thf(conj, conjecture, ![X2:$i > $i, X3:$i > $i]:((((if @ (($true)) @ X2 @ X3)=(X2))&((if @ (~($true)) @ X2 @ X3)=(X3)))), file('/export/starexec/sandbox2/tmp/tmp.qpnQLvjgvK/E---3.1_5211.p', conj)).
0.21/0.50	thf(choiceaxii, axiom, ![X5:($i > $i) > $o]:((?[X2:$i > $i]:((X5 @ X2))=>(X5 @ (epsii @ X5)))), file('/export/starexec/sandbox2/tmp/tmp.qpnQLvjgvK/E---3.1_5211.p', choiceaxii)).
0.21/0.50	thf(c_0_3, plain, ((if)=(^[Z0/* 19 */:$o, Z1:$i > $i, Z2:$i > $i]:(epsii @ (^[Z3/* 9 */:$i > $i]:((((Z0)&((Z3)=(Z1)))|(~((Z0))&(Z3)))))))), inference(fof_simplification,[status(thm)],[ifd])).
0.21/0.50	thf(c_0_4, negated_conjecture, ~(![X2:$i > $i, X3:$i > $i]:((((epsii @ (^[Z0/* 9 */:$i > $i]:((($true&((Z0)=(X2)))|(~($true)&((Z0)=(X3)))))))=(X2))&((epsii @ (^[Z0/* 9 */:$i > $i]:(((~($true)&((Z0)=(X2)))|(~(~($true))&((Z0)=(X3)))))))=(X3))))), inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]), c_0_3])).
0.21/0.50	thf(c_0_5, negated_conjecture, (((epsii @ (^[Z0/* 9 */:$i > $i]:((($true&((Z0)=(esk1_0)))|(~($true)&((Z0)=(esk2_0)))))))!=(esk1_0))|((epsii @ (^[Z0/* 9 */:$i > $i]:(((~($true)&((Z0)=(esk1_0)))|(~(~($true))&((Z0)=(esk2_0)))))))!=(esk2_0))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])).
0.21/0.50	thf(c_0_6, negated_conjecture, (((epsii @ (^[Z0/* 9 */:$i > $i]:(((($true)&((Z0)=(esk1_0)))|(~(($true))&((Z0)=(esk2_0)))))))!=(esk1_0))|((epsii @ (^[Z0/* 9 */:$i > $i]:(((~(($true))&((Z0)=(esk1_0)))|(~(~(($true)))&((Z0)=(esk2_0)))))))!=(esk2_0))), inference(split_conjunct,[status(thm)],[c_0_5])).
0.21/0.50	thf(c_0_7, plain, ![X12:($i > $i) > $o, X13:$i > $i]:((~(X12 @ X13)|(X12 @ (epsii @ X12)))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[choiceaxii])])])])).
0.21/0.50	thf(c_0_8, negated_conjecture, (((epsii @ (^[Z0/* 3 */:$i > $i]:(((Z0)=(esk2_0)))))!=(esk2_0))|((epsii @ (^[Z0/* 3 */:$i > $i]:(((Z0)=(esk1_0)))))!=(esk1_0))), inference(cn,[status(thm)],[c_0_6])).
0.21/0.50	thf(c_0_9, plain, ![X5:($i > $i) > $o, X2:$i > $i]:(((X5 @ (epsii @ X5))|~((X5 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.21/0.50	thf(c_0_10, negated_conjecture, ((epsii @ (^[Z0/* 3 */:$i > $i]:(((Z0)=(esk2_0)))))=(esk2_0)), inference(er,[status(thm)],[inference(choice_inst,[status(thm)],[inference(cn,[status(thm)],[]), c_0_8, c_0_9])])).
0.21/0.50	thf(c_0_11, negated_conjecture, ((epsii @ (^[Z0/* 3 */:$i > $i]:(((Z0)=(esk1_0)))))!=(esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8, c_0_10])])).
0.21/0.50	thf(c_0_12, negated_conjecture, ($false), inference(er,[status(thm)],[inference(sr,[status(thm)],[inference(choice_inst,[status(thm)],[inference(cn,[status(thm)],[]), c_0_11, c_0_9]), c_0_11])]), ['proof']).
0.21/0.50	# SZS output end CNFRefutation
0.21/0.50	# Parsed axioms                        : 5
0.21/0.50	# Removed by relevancy pruning/SinE    : 2
0.21/0.50	# Initial clauses                      : 2
0.21/0.50	# Removed in clause preprocessing      : 0
0.21/0.50	# Initial clauses in saturation        : 2
0.21/0.50	# Processed clauses                    : 11
0.21/0.50	# ...of these trivial                  : 0
0.21/0.50	# ...subsumed                          : 0
0.21/0.50	# ...remaining for further processing  : 11
0.21/0.50	# Other redundant clauses eliminated   : 5
0.21/0.50	# Clauses deleted for lack of memory   : 0
0.21/0.50	# Backward-subsumed                    : 1
0.21/0.50	# Backward-rewritten                   : 2
0.21/0.50	# Generated clauses                    : 23
0.21/0.50	# ...of the previous two non-redundant : 19
0.21/0.50	# ...aggressively subsumed             : 0
0.21/0.50	# Contextual simplify-reflections      : 0
0.21/0.50	# Paramodulations                      : 0
0.21/0.50	# Factorizations                       : 0
0.21/0.50	# NegExts                              : 6
0.21/0.50	# Equation resolutions                 : 5
0.21/0.50	# Disequality decompositions           : 0
0.21/0.50	# Total rewrite steps                  : 2
0.21/0.50	# ...of those cached                   : 1
0.21/0.50	# Propositional unsat checks           : 0
0.21/0.50	#    Propositional check models        : 0
0.21/0.50	#    Propositional check unsatisfiable : 0
0.21/0.50	#    Propositional clauses             : 0
0.21/0.50	#    Propositional clauses after purity: 0
0.21/0.50	#    Propositional unsat core size     : 0
0.21/0.50	#    Propositional preprocessing time  : 0.000
0.21/0.50	#    Propositional encoding time       : 0.000
0.21/0.50	#    Propositional solver time         : 0.000
0.21/0.50	#    Success case prop preproc time    : 0.000
0.21/0.50	#    Success case prop encoding time   : 0.000
0.21/0.50	#    Success case prop solver time     : 0.000
0.21/0.50	# Current number of processed clauses  : 6
0.21/0.50	#    Positive orientable unit clauses  : 1
0.21/0.50	#    Positive unorientable unit clauses: 0
0.21/0.50	#    Negative unit clauses             : 1
0.21/0.50	#    Non-unit-clauses                  : 4
0.21/0.50	# Current number of unprocessed clauses: 10
0.21/0.50	# ...number of literals in the above   : 15
0.21/0.50	# Current number of archived formulas  : 0
0.21/0.50	# Current number of archived clauses   : 5
0.21/0.50	# Clause-clause subsumption calls (NU) : 20
0.21/0.50	# Rec. Clause-clause subsumption calls : 12
0.21/0.50	# Non-unit clause-clause subsumptions  : 0
0.21/0.50	# Unit Clause-clause subsumption calls : 3
0.21/0.50	# Rewrite failures with RHS unbound    : 0
0.21/0.50	# BW rewrite match attempts            : 2
0.21/0.50	# BW rewrite match successes           : 1
0.21/0.50	# Condensation attempts                : 11
0.21/0.50	# Condensation successes               : 0
0.21/0.50	# Termbank termtop insertions          : 1955
0.21/0.50	# Search garbage collected termcells   : 112
0.21/0.50	
0.21/0.50	# -------------------------------------------------
0.21/0.50	# User time                : 0.004 s
0.21/0.50	# System time              : 0.001 s
0.21/0.50	# Total time               : 0.006 s
0.21/0.50	# Maximum resident set size: 1712 pages
0.21/0.50	
0.21/0.50	# -------------------------------------------------
0.21/0.50	# User time                : 0.005 s
0.21/0.50	# System time              : 0.004 s
0.21/0.50	# Total time               : 0.009 s
0.21/0.50	# Maximum resident set size: 1732 pages
0.21/0.50	% E exiting
0.21/0.51	% E exiting
0.21/0.51	EOF